Slides Rule

Induction Slides

Lecture Slides

Consider the initial value problem u = f (u, t), u(t 0) = u 0 An mth order system of s equations can be reduced to a system of ms first order equations, by introducing new variables v 1 = u , v 2 = u ,. .. , v m−1 = u (m−1). The explicit time-dependency can be removed by introducing a new variable w = t with the trivial equation w = 1, to obtain a new autonomous system of equations A linear sys...

Lecture Slides

This paper describes an efficient algorithm to determine whether an arbitrary graph G can be embedded in the plane. The algorithm may be viewed as an iterative version of a method originally proposed by Auslander and Parter and correctly formulated by Goldstein. The algorithm uses depth-first search and has O(V) time and space bounds, where V is the number of vertices in G. An ALGOS implementat...

Backward Jeu de Taquin Slides for Composition Tableaux and a Noncommutative Pieri Rule

We give a backward jeu de taquin slide analogue on semistandard reverse composition tableaux. These tableaux were first studied by Haglund, Luoto, Mason and van Willigenburg when defining quasisymmetric Schur functions. Our algorithm for performing backward jeu de taquin slides on semistandard reverse composition tableaux results in a natural operator on compositions that we call the jdt operat...

Presentation Slides

Presentations are becoming an increasingly more common means of communication in working environments, and slides are often the necessary supporting material on which the presentations rely. In this paper, we describe a slide indexing and retrieval system in which the slides are captured as images (through a framegrabber) at the moment they are displayed during a presentation and then transcrib...